Bertini Irreducibility Theorems over Finite Fields

Construction of Irreducible Polynomials over Finite Fields

In this paper we investigate some results on the construction of irreducible polynomials over finite fields. Basic results on finite fields are introduced and proved. Several theorems proving irreducibility of certain polynomials over finite fields are presented and proved. Two theorems on the construction of special sequences of irreducible polynomials over finite fields are investigated in de...

Bertini Theorems over Finite Fields

Let X be a smooth quasiprojective subscheme of P of dimension m ≥ 0 over Fq. Then there exist homogeneous polynomials f over Fq for which the intersection of X and the hypersurface f = 0 is smooth. In fact, the set of such f has a positive density, equal to ζX(m + 1) −1, where ζX(s) = ZX(q −s) is the zeta function of X. An analogue for regular quasiprojective schemes over Z is proved, assuming ...

Factoring and Testing Irreducibility of Sparse Polynomials over Small Finite Fields

Deterministic Irreducibility Testing of Polynomials over Large Finite Fields

We present a sequential deterministic polynomial-time algorithm for testing dense multivariate polynomials over a large finite field for irreducibility. All previously known algorithms were of a probabilistic nature. Our deterministic solution is based on our algorithm for absolute irreducibility testing combined with Berlekamp’s algorithm.

Étale Cohomology, Lefschetz Theorems and Number of Points of Singular Varieties over Finite Fields

We prove a general inequality for estimating the number of points of arbitrary complete intersections over a finite field. This extends a result of Deligne for nonsingular complete intersections. For normal complete intersections, this inequality generalizes also the classical Lang-Weil inequality. Moreover, we prove the Lang-Weil inequality for affine as well as projective varieties with an ex...